1 Parallel Semidefinite Programming and Combinatorial Optimization STEVEN
نویسنده
چکیده
The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial problems often involve approximating the convex hull of the solution set and establishing lower bounds on the solution. Polyhedral approximations that use linear programming (LP) methodologies have been successful for many combinatorial problems, but they have not been as successful for problems such as maximum cut and maximum stable set. The semidefinite approximation for the stable set problem was proposed by Grötschel, Lovász, and Shrijver [32] and further developed by Alizadeh [1], Polijak, Rendl, and Wolkowicz [48], and many other authors. The Lovász number [43] is the solution of an SDP that provides an upper bound to the maximum clique of a graph and a lower bound to its chromatic number. Tractable bounds have also been provided for MAXCUT [30], graph bisection [47], MAX k-CUT [27, 24], graph coloring [33], and the quadratic assignment problem [61]. Many more combinatorial problems can be relaxed into a semidefinite program, and some of these relaxations offer a projection back to a feasible solution that is guaranteed to be within a specified fraction of optimality. These combinatorial problems are NP hard in the general case, so even approximate solutions are difficult to find. Most polyhedral relaxations do not offer a performance guarantee, but Geomans and
منابع مشابه
Parallel Primal-dual Interior-point Methods for Semidefinite Programs B-415 Parallel Primal-dual Interior-point Methods for Semidefinite Programs
The Semidefinite Program (SDP) is a fundamental problem in mathematical programming. It covers a wide range of applications, such as combinatorial optimization, control theory, polynomial optimization, and quantum chemistry. Solving extremely large-scale SDPs which could not be solved before is a significant work to open up a new vista of future applications of SDPs. Our two software packages S...
متن کاملSolving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
We present a dual-scaling interior-point algorithm and show how it exploits the structure and sparsity of some large scale problems. We solve the positive semideenite relaxation of combinatorial and quadratic optimization problems subject to boolean constraints. We report the rst computational results of interior-point algorithms for approximating the maximum cut semideenite programs with dimen...
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Semidefinite Programming 22.1 Semidefinite Programming Problem
In this lecture, we provide another class of relaxations, called Semidefinite Programming Relaxation. These serve as relaxations for several NP-hard problems, in particular, for problems that can be expressed as strict quadratic programs. The relaxed problems, together with techniques like randomized rounding, give good approximation algorithms to hard combinatorial problems. We will illustrate...
متن کاملProduct Rules in Semidefinite Programming
In recent years we witness the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4] and even in complexity theory [7]. Examples to such bounds include the semidefinite relaxation for the maximal cut problem [5], and the quantum value of multi-prover interactive games [3,4]. The first semidefinite programming bound, which gained fa...
متن کاملSemidefinite Programming and Combinatorial Optimization
We describe a few applications of semide nite programming in combinatorial optimization Mathematics Subject Classi cation C C C C C R
متن کامل